Termination proof of /tmp/tmp5WoJG

Termination of the given JBC could be proven:

0 JBC

↳1 JBC2FIG (⇒)

↳2 JBCTerminationGraph

↳3 FIGtoITRSProof (⇒)

↳4 AND

    ↳5 IDP

        ↳6 IDPtoQDPProof (⇒)

        ↳7 QDP

        ↳8 UsableRulesProof (⇔)

        ↳9 QDP

        ↳10 QReductionProof (⇔)

        ↳11 QDP

        ↳12 QDPSizeChangeProof (⇔)

        ↳13 YES

    ↳14 IDP

        ↳15 IDPNonInfProof (⇒)

        ↳16 AND

            ↳17 IDP

                ↳18 IDependencyGraphProof (⇔)

                ↳19 TRUE

            ↳20 IDP

                ↳21 IDependencyGraphProof (⇔)

                ↳22 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_20 (Apple Inc.) Main-Class: BTreeR

public class BTreeR {
    private BTreeR left, right;

    public BTreeR(int height) {
	if (height > 1) {
	    this.left = new BTreeR(height - 1);
	    this.right = new BTreeR(height - 1);
	}
    }

    public int height() {
	if (left == null && right == null) return 1;
	else if (left == null) return 1 + right.height();
	else return 1 + left.height();
    }

    public static void main(String[] args) {
	Random.args = args;
	BTreeR bt = new BTreeR(Random.random()*Random.random()+10);
	bt.height();
    }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
      if (index >= args.length)
	  return 0;

      String string = args[index];
      index++;
      return string.length();
  }
}

(1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

(2) Obligation:

FIGraph based on JBC Program:
BTreeR.main([Ljava/lang/String;)V: Graph of 213 nodes with 0 SCCs.

BTreeR.<init>(I)V: Graph of 37 nodes with 0 SCCs.

BTreeR.height()I: Graph of 78 nodes with 0 SCCs.

(3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Logs:

Log for SCC 0:

Generated 31 rules for P and 51 rules for R.

Combined rules. Obtained 2 rules for P and 14 rules for R.

Filtered ground terms:

BTreeR(x1, x2, x3) → BTreeR(x2, x3)
970_0_height_FieldAccess(x1, x2, x3) → 970_0_height_FieldAccess(x2, x3)
1746_0_height_Return(x1, x2) → 1746_0_height_Return(x2)
2092_0_height_Return(x1, x2) → 2092_0_height_Return(x2)
2084_0_height_Return(x1) → 2084_0_height_Return
1730_0_height_Return(x1) → 1730_0_height_Return
1134_0_height_Return(x1, x2) → 1134_0_height_Return
1018_0_height_Return(x1) → 1018_0_height_Return
998_0_height_Return(x1, x2) → 998_0_height_Return

Filtered duplicate args:

970_0_height_FieldAccess(x1, x2) → 970_0_height_FieldAccess(x2)

Finished conversion. Obtained 2 rules for P and 14 rules for R. System has no predefined symbols.

Log for SCC 1:

Generated 32 rules for P and 8 rules for R.

Combined rules. Obtained 3 rules for P and 2 rules for R.

Filtered ground terms:

479_0_<init>_InvokeMethod(x1, x2) → 479_0_<init>_InvokeMethod(x2)
Cond_606_1_<init>_InvokeMethod1(x1, x2, x3, x4) → Cond_606_1_<init>_InvokeMethod1(x1, x3, x4)
828_0_<init>_Return(x1) → 828_0_<init>_Return
Cond_606_1_<init>_InvokeMethod(x1, x2, x3, x4) → Cond_606_1_<init>_InvokeMethod(x1, x3)
531_0_<init>_Return(x1) → 531_0_<init>_Return
Cond_479_0_<init>_InvokeMethod(x1, x2, x3) → Cond_479_0_<init>_InvokeMethod(x1, x3)

Filtered unneeded arguments:

Cond_606_1_<init>_InvokeMethod1(x1, x2, x3) → Cond_606_1_<init>_InvokeMethod1(x1, x2)

Combined rules. Obtained 3 rules for P and 2 rules for R.

Finished conversion. Obtained 3 rules for P and 2 rules for R. System has predefined symbols.

(4) Complex Obligation (AND)

(5) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:
none

The ITRS R consists of the following rules:
1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL))) → 1018_0_height_Return
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0))) → 2084_0_height_Return
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL))))) → 1730_0_height_Return
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2))) → 2084_0_height_Return
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))) → 1730_0_height_Return
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3))) → 2084_0_height_Return
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))) → 1730_0_height_Return
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL))) → 1134_0_height_Return
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))))

The integer pair graph contains the following rules and edges:
(0): 970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[0]))
(1): 970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[1]))

(0) -> (0), if ((java.lang.Object(x0[0]) →^* java.lang.Object(BTreeR(java.lang.Object(x0[0]'), x1[0]'))))

(0) -> (1), if ((java.lang.Object(x0[0]) →^* java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))))

(1) -> (0), if ((java.lang.Object(x0[1]) →^* java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))))

(1) -> (1), if ((java.lang.Object(x0[1]) →^* java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1]')))))

The set Q consists of the following terms:
1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL)))
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL)))
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))

(6) IDPtoQDPProof (SOUND transformation)

Represented integers and predefined function symbols by Terms

(7) Obligation:

Q DP problem:
The TRS P consists of the following rules:

970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[0]))
970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[1]))

The TRS R consists of the following rules:

1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL))) → 1018_0_height_Return
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0))) → 2084_0_height_Return
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL))))) → 1730_0_height_Return
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2))) → 2084_0_height_Return
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))) → 1730_0_height_Return
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3))) → 2084_0_height_Return
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))) → 1730_0_height_Return
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL))) → 1134_0_height_Return
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3))) → 2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))) → 1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))))

The set Q consists of the following terms:

1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL)))
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL)))
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))

We have to consider all minimal (P,Q,R)-chains.

(8) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[0]))
970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[1]))

R is empty.
The set Q consists of the following terms:

1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL)))
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL)))
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))

We have to consider all minimal (P,Q,R)-chains.

(10) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

1010_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, NULL)))
1010_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1010_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1010_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1010_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1010_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1010_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))
1041_1_height_InvokeMethod(998_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))), java.lang.Object(BTreeR(NULL, NULL)))
1041_1_height_InvokeMethod(1018_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, NULL)), x0)))
1041_1_height_InvokeMethod(1134_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, NULL)))))
1041_1_height_InvokeMethod(1730_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))), x2)))
1041_1_height_InvokeMethod(1746_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(x0, x1)))))))
1041_1_height_InvokeMethod(2084_0_height_Return, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))), java.lang.Object(BTreeR(java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)), x3)))
1041_1_height_InvokeMethod(2092_0_height_Return(java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))), java.lang.Object(BTreeR(NULL, java.lang.Object(BTreeR(java.lang.Object(BTreeR(x0, x1)), x2)))))

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[0]))
970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[1]))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(java.lang.Object(x0[0]), x1[0]))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[0]))
The graph contains the following edges 1 > 1
970_0_HEIGHT_FIELDACCESS(java.lang.Object(BTreeR(NULL, java.lang.Object(x0[1])))) → 970_0_HEIGHT_FIELDACCESS(java.lang.Object(x0[1]))
The graph contains the following edges 1 > 1

(13) YES

(14) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

The ITRS R consists of the following rules:
740_1_<init>_InvokeMethod(531_0_<init>_Return, 1) → 828_0_<init>_Return
740_1_<init>_InvokeMethod(828_0_<init>_Return, x0) → 828_0_<init>_Return

The integer pair graph contains the following rules and edges:
(0): 479_0_<INIT>_INVOKEMETHOD(x0[0]) → COND_479_0_<INIT>_INVOKEMETHOD(x0[0] > 1, x0[0])
(1): COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1]) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(x0[1] - 1), x0[1], x0[1] - 1)
(2): COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2]) → 479_0_<INIT>_INVOKEMETHOD(x0[2] - 1)
(3): 606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1) → COND_606_1_<INIT>_INVOKEMETHOD(x0[3] > 0, 531_0_<init>_Return, x0[3], 1)
(4): COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1) → 479_0_<INIT>_INVOKEMETHOD(x0[4] - 1)
(5): 606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5]) → COND_606_1_<INIT>_INVOKEMETHOD1(x0[5] > 0, 828_0_<init>_Return, x0[5], x1[5])
(6): COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6]) → 479_0_<INIT>_INVOKEMETHOD(x0[6] - 1)

(0) -> (1), if ((x0[0] > 1 →^* TRUE)∧(x0[0] →^* x0[1]))

(0) -> (2), if ((x0[0] > 1 →^* TRUE)∧(x0[0] →^* x0[2]))

(1) -> (3), if ((479_0_<init>_InvokeMethod(x0[1] - 1) →^* 531_0_<init>_Return)∧(x0[1] →^* x0[3])∧(x0[1] - 1 →^* 1))

(1) -> (5), if ((479_0_<init>_InvokeMethod(x0[1] - 1) →^* 828_0_<init>_Return)∧(x0[1] →^* x0[5])∧(x0[1] - 1 →^* x1[5]))

(2) -> (0), if ((x0[2] - 1 →^* x0[0]))

(3) -> (4), if ((x0[3] > 0 →^* TRUE)∧(x0[3] →^* x0[4]))

(4) -> (0), if ((x0[4] - 1 →^* x0[0]))

(5) -> (6), if ((x0[5] > 0 →^* TRUE)∧(x0[5] →^* x0[6])∧(x1[5] →^* x1[6]))

(6) -> (0), if ((x0[6] - 1 →^* x0[0]))

The set Q consists of the following terms:
740_1_<init>_InvokeMethod(531_0_<init>_Return, 1)
740_1_<init>_InvokeMethod(828_0_<init>_Return, x0)

(15) IDPNonInfProof (SOUND transformation)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 479_0_<INIT>_INVOKEMETHOD(x0) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0, 1), x0) the following chains were created:

We consider the chain 479_0_<INIT>_INVOKEMETHOD(x0[0]) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0]), COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1]) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1)) which results in the following constraint:
(1)    (>(x0[0], 1)=TRUE∧x0[0]=x0[1] ⇒ 479_0_<INIT>_INVOKEMETHOD(x0[0])≥NonInfC∧479_0_<INIT>_INVOKEMETHOD(x0[0])≥COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])∧(U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥))

We simplified constraint (1) using rule (IV) which results in the following new constraint:
(2)    (>(x0[0], 1)=TRUE ⇒ 479_0_<INIT>_INVOKEMETHOD(x0[0])≥NonInfC∧479_0_<INIT>_INVOKEMETHOD(x0[0])≥COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])∧(U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x0[0] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[(3)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)
We consider the chain 479_0_<INIT>_INVOKEMETHOD(x0[0]) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0]), COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1)) which results in the following constraint:
(7)    (>(x0[0], 1)=TRUE∧x0[0]=x0[2] ⇒ 479_0_<INIT>_INVOKEMETHOD(x0[0])≥NonInfC∧479_0_<INIT>_INVOKEMETHOD(x0[0])≥COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])∧(U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥))

We simplified constraint (7) using rule (IV) which results in the following new constraint:
(8)    (>(x0[0], 1)=TRUE ⇒ 479_0_<INIT>_INVOKEMETHOD(x0[0])≥NonInfC∧479_0_<INIT>_INVOKEMETHOD(x0[0])≥COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])∧(U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    (x0[0] + [-2] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(12)    (x0[0] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[(3)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

For Pair COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0, 1)), x0, -(x0, 1)) the following chains were created:

We consider the chain COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1]) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1)) which results in the following constraint:
(13)    (COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1])≥NonInfC∧COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1])≥606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))∧(U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥))

We simplified constraint (13) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(14)    ((U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥)∧[(-1)bso_20] ≥ 0)

We simplified constraint (14) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(15)    ((U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥)∧[(-1)bso_20] ≥ 0)

We simplified constraint (15) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(16)    ((U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥)∧[(-1)bso_20] ≥ 0)

We simplified constraint (16) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(17)    ((U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥)∧0 = 0∧[(-1)bso_20] ≥ 0)

For Pair COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1)) the following chains were created:

We consider the chain COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1)) which results in the following constraint:
(18)    (COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2])≥NonInfC∧COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2])≥479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))∧(U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥))

We simplified constraint (18) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(19)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥)∧[1 + (-1)bso_22] ≥ 0)

We simplified constraint (19) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(20)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥)∧[1 + (-1)bso_22] ≥ 0)

We simplified constraint (20) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(21)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥)∧[1 + (-1)bso_22] ≥ 0)

We simplified constraint (21) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(22)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥)∧0 = 0∧[1 + (-1)bso_22] ≥ 0)

For Pair 606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0, 1) → COND_606_1_<INIT>_INVOKEMETHOD(>(x0, 0), 531_0_<init>_Return, x0, 1) the following chains were created:

We consider the chain 606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1) → COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1), COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1) → 479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1)) which results in the following constraint:
(23)    (>(x0[3], 0)=TRUE∧x0[3]=x0[4] ⇒ 606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1)≥NonInfC∧606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1)≥COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)∧(U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥))

We simplified constraint (23) using rule (IV) which results in the following new constraint:
(24)    (>(x0[3], 0)=TRUE ⇒ 606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1)≥NonInfC∧606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1)≥COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)∧(U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥))

We simplified constraint (24) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(25)    (x0[3] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥)∧[bni_23 + (-1)Bound*bni_23] + [bni_23]x0[3] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (25) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(26)    (x0[3] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥)∧[bni_23 + (-1)Bound*bni_23] + [bni_23]x0[3] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (26) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(27)    (x0[3] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥)∧[bni_23 + (-1)Bound*bni_23] + [bni_23]x0[3] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (27) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(28)    (x0[3] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥)∧[(2)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[3] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

For Pair COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0, 1) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1)) the following chains were created:

We consider the chain COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1) → 479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1)) which results in the following constraint:
(29)    (COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1)≥NonInfC∧COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1)≥479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))∧(U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥))

We simplified constraint (29) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(30)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥)∧[(-1)bso_26] ≥ 0)

We simplified constraint (30) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(31)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥)∧[(-1)bso_26] ≥ 0)

We simplified constraint (31) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(32)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥)∧[(-1)bso_26] ≥ 0)

We simplified constraint (32) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(33)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥)∧0 = 0∧[(-1)bso_26] ≥ 0)

For Pair 606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0, x1) → COND_606_1_<INIT>_INVOKEMETHOD1(>(x0, 0), 828_0_<init>_Return, x0, x1) the following chains were created:

We consider the chain 606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5]) → COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5]), COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1)) which results in the following constraint:
(34)    (>(x0[5], 0)=TRUE∧x0[5]=x0[6]∧x1[5]=x1[6] ⇒ 606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5])≥NonInfC∧606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5])≥COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])∧(U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥))

We simplified constraint (34) using rule (IV) which results in the following new constraint:
(35)    (>(x0[5], 0)=TRUE ⇒ 606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5])≥NonInfC∧606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5])≥COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])∧(U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥))

We simplified constraint (35) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(36)    (x0[5] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧[bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧[(-1)bso_28] ≥ 0)

We simplified constraint (36) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(37)    (x0[5] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧[bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧[(-1)bso_28] ≥ 0)

We simplified constraint (37) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(38)    (x0[5] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧[bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧[(-1)bso_28] ≥ 0)

We simplified constraint (38) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(39)    (x0[5] + [-1] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧0 = 0∧[bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧0 = 0∧[(-1)bso_28] ≥ 0)

We simplified constraint (39) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(40)    (x0[5] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧0 = 0∧[(2)bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧0 = 0∧[(-1)bso_28] ≥ 0)

For Pair COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0, x1) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1)) the following chains were created:

We consider the chain COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1)) which results in the following constraint:
(41)    (COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6])≥NonInfC∧COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6])≥479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))∧(U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥))

We simplified constraint (41) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(42)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥)∧[1 + (-1)bso_30] ≥ 0)

We simplified constraint (42) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(43)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥)∧[1 + (-1)bso_30] ≥ 0)

We simplified constraint (43) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(44)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥)∧[1 + (-1)bso_30] ≥ 0)

We simplified constraint (44) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(45)    ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_30] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

479_0_<INIT>_INVOKEMETHOD(x0) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0, 1), x0)
- (x0[0] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[(3)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)
- (x0[0] ≥ 0 ⇒ (U^Increasing(COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])), ≥)∧[(3)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)
COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0, 1)), x0, -(x0, 1))
- ((U^Increasing(606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))), ≥)∧0 = 0∧[(-1)bso_20] ≥ 0)
COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1))
- ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))), ≥)∧0 = 0∧[1 + (-1)bso_22] ≥ 0)
606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0, 1) → COND_606_1_<INIT>_INVOKEMETHOD(>(x0, 0), 531_0_<init>_Return, x0, 1)
- (x0[3] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)), ≥)∧[(2)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[3] ≥ 0∧[1 + (-1)bso_24] ≥ 0)
COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0, 1) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1))
- ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))), ≥)∧0 = 0∧[(-1)bso_26] ≥ 0)
606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0, x1) → COND_606_1_<INIT>_INVOKEMETHOD1(>(x0, 0), 828_0_<init>_Return, x0, x1)
- (x0[5] ≥ 0 ⇒ (U^Increasing(COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])), ≥)∧0 = 0∧[(2)bni_27 + (-1)Bound*bni_27] + [bni_27]x0[5] ≥ 0∧0 = 0∧[(-1)bso_28] ≥ 0)
COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0, x1) → 479_0_<INIT>_INVOKEMETHOD(-(x0, 1))
- ((U^Increasing(479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_30] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(740_1_<init>_InvokeMethod(x₁, x₂)) = [-1]
POL(531_0_<init>_Return) = [-1]
POL(1) = [1]
POL(828_0_<init>_Return) = [1]
POL(479_0_<INIT>_INVOKEMETHOD(x₁)) = [1] + x₁
POL(COND_479_0_<INIT>_INVOKEMETHOD(x₁, x₂)) = [1] + x₂
POL(>(x₁, x₂)) = [-1]
POL(606_1_<INIT>_INVOKEMETHOD(x₁, x₂, x₃)) = [1] + x₂
POL(479_0_<init>_InvokeMethod(x₁)) = x₁
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(COND_606_1_<INIT>_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = x₃
POL(0) = 0
POL(COND_606_1_<INIT>_INVOKEMETHOD1(x₁, x₂, x₃, x₄)) = [1] + x₃

The following pairs are in P_>:

COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[2], 1))
606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1) → COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)
COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6]) → 479_0_<INIT>_INVOKEMETHOD(-(x0[6], 1))

The following pairs are in P_bound:

479_0_<INIT>_INVOKEMETHOD(x0[0]) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])
606_1_<INIT>_INVOKEMETHOD(531_0_<init>_Return, x0[3], 1) → COND_606_1_<INIT>_INVOKEMETHOD(>(x0[3], 0), 531_0_<init>_Return, x0[3], 1)
606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5]) → COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])

The following pairs are in P_≥:

479_0_<INIT>_INVOKEMETHOD(x0[0]) → COND_479_0_<INIT>_INVOKEMETHOD(>(x0[0], 1), x0[0])
COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1]) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(-(x0[1], 1)), x0[1], -(x0[1], 1))
COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1) → 479_0_<INIT>_INVOKEMETHOD(-(x0[4], 1))
606_1_<INIT>_INVOKEMETHOD(828_0_<init>_Return, x0[5], x1[5]) → COND_606_1_<INIT>_INVOKEMETHOD1(>(x0[5], 0), 828_0_<init>_Return, x0[5], x1[5])

There are no usable rules.

(16) Complex Obligation (AND)

(17) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

(4) -> (0), if ((x0[4] - 1 →^* x0[0]))

(0) -> (1), if ((x0[0] > 1 →^* TRUE)∧(x0[0] →^* x0[1]))

(1) -> (5), if ((479_0_<init>_InvokeMethod(x0[1] - 1) →^* 828_0_<init>_Return)∧(x0[1] →^* x0[5])∧(x0[1] - 1 →^* x1[5]))

The set Q consists of the following terms:
740_1_<init>_InvokeMethod(531_0_<init>_Return, 1)
740_1_<init>_InvokeMethod(828_0_<init>_Return, x0)

(18) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 4 less nodes.

(19) TRUE

(20) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

The ITRS R consists of the following rules:
740_1_<init>_InvokeMethod(531_0_<init>_Return, 1) → 828_0_<init>_Return
740_1_<init>_InvokeMethod(828_0_<init>_Return, x0) → 828_0_<init>_Return

The integer pair graph contains the following rules and edges:
(1): COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[1]) → 606_1_<INIT>_INVOKEMETHOD(479_0_<init>_InvokeMethod(x0[1] - 1), x0[1], x0[1] - 1)
(2): COND_479_0_<INIT>_INVOKEMETHOD(TRUE, x0[2]) → 479_0_<INIT>_INVOKEMETHOD(x0[2] - 1)
(4): COND_606_1_<INIT>_INVOKEMETHOD(TRUE, 531_0_<init>_Return, x0[4], 1) → 479_0_<INIT>_INVOKEMETHOD(x0[4] - 1)
(6): COND_606_1_<INIT>_INVOKEMETHOD1(TRUE, 828_0_<init>_Return, x0[6], x1[6]) → 479_0_<INIT>_INVOKEMETHOD(x0[6] - 1)

The set Q consists of the following terms:
740_1_<init>_InvokeMethod(531_0_<init>_Return, 1)
740_1_<init>_InvokeMethod(828_0_<init>_Return, x0)

(21) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 4 less nodes.

(0) Obligation:

(1) JBC2FIG (SOUND transformation)

(2) Obligation:

(3) FIGtoITRSProof (SOUND transformation)

(4) Complex Obligation (AND)

(5) Obligation:

(6) IDPtoQDPProof (SOUND transformation)

(7) Obligation:

(8) UsableRulesProof (EQUIVALENT transformation)

(9) Obligation:

(10) QReductionProof (EQUIVALENT transformation)

(11) Obligation:

(12) QDPSizeChangeProof (EQUIVALENT transformation)

(13) YES

(14) Obligation:

(15) IDPNonInfProof (SOUND transformation)

(16) Complex Obligation (AND)

(17) Obligation:

(18) IDependencyGraphProof (EQUIVALENT transformation)

(19) TRUE

(20) Obligation:

(21) IDependencyGraphProof (EQUIVALENT transformation)

(22) TRUE